Secure Information Transfer Based on Global Position

ABSTRACT

Secure communication of information is effected from a first party to a second party when the first party knows its own global location and the global location of the second party, and employs what essentially is an undiscoverable code signal that is broadcast to, and received by, both the first and the second parties. The first party securely communicates information to the second party by modifying the code signal with the information that is to be communicated and sends the modified code signal to the second party. Illustratively, the code signal is related to the Y component of a GPS signal.

RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 12/231,094, which was filed on Aug. 29, 2008 which is a continuation in part of U.S. patent application, Ser. No. 12/012,327, which was filed on Feb. 2, 2008.

BACKGROUND OF THE INVENTION

When information needs to be communicated in a secure manner one typically turns to cryptographic techniques. It is generally recognized that with many cryptographic techniques the encrypted data can be recovered by an adversary, but only if the adversary has sufficient resources (e.g., computing power) and sufficient time. Most users are satisfied when a method is secure “enough,” meaning that the time, effort, or expense to recover the data embedded in an encrypted message is too great to make the data useful to an adversary.

With the above in mind, cryptographic techniques usually depend on encryption and decryption keys being in possession of the communicating parties. Aside from the concern about the inherent security of message encrypted with a particular method, the biggest concern is with the secure creation, distribution and maintenance of the keys.

SUMMARY OF THE INVENTION

An advance in the art is achieved with a method that implements secure transmission of information from one party to another without the need for cryptographic keys but, rather, based on unique geographic attributes such as position as well as time. More specifically, secure communication of information is effected from a first party to a second party when the first party knows its own global location and the global location of the second party, and employs a code signal that is broadcast to, and received by, both the first and the second parties. The first party securely communicates information to the second party by modifying the code signal with the information that is to be communicated and sends the modified code signal to the second party. The code signal that is received by the first party and is used to convey information to the second party need not to be actually known to either of the parties, and from the standpoint of secure communication it is advantageous for the broadcasted code signal (and the corresponding related received signals) to not be known to either of the parties and to be essentially impossible for the parties to discover. The signal that is employed in the disclosed illustrative example is related to the Y component of a GPS signal. Other wireless sources that are modified to include a signal like the Y component of the GPS signal can also be employed.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a first unit that securely transmits information without the use of cryptographic keys;

FIG. 2 shows some of the processing within processor 40 of FIG. 1; and

FIG. 3 depicts some of the processing within a unit that receives the signal transmitted by the FIG. 1 unit.

DETAILED DESCRIPTION

U.S. patent application Ser. No. 12/012,327 discloses an approach whereby a first device, at location x, can verify an assertion by a second device, at location y, as to the global position of the second device. The disclosure presented an illustrative embodiment that is based on the Global Positioning System (GPS) but the principles disclosed therein are broader and are not limited to the GPS. For examples, they can be readily applied to the other global navigation satellite systems being developed and deployed worldwide.

To assist the reader in understanding the instant invention without having to read the aforementioned application, the following repeats a significant portion of the mathematical underpinnings presented in the 12/012,327 application. It should be kept in mind that here, as well, the principles of the disclosed invention are broader than the illustrative example that uses the GPS.

FIG. 1 shows unit 100 that belongs to Remote Device B, which simultaneously receives a number of GPS satellite signals on frequency L1, where the signal transmitted by satellite n can be expressed as

S _(transmitted) ^(n) =A ^(n) D ^(n)(t)x _(C) ^(n)(t)cos(2π(f _(L1))t+φ ₁)+B ^(n) D ^(n)(t)x _(Y) ^(n)(t)sin(2π(f _(L1))t+φ ₁)  (1)

where D^(n)(t) is the data signal of satellite n, x_(C) ^(n)(t) is a code signal assigned to satellite n that is publicly known, x_(Y) ^(n)(t) is a code signal assigned to satellite n that is not publicly known, f_(L1) is the frequency of the carrier, and φ₁ is the phase of the carrier relative to the beginning of the data and code signals. Unit 100 is the party that wishes to send information to a remote unit 200 without the use of cryptographic keys.

A GPS receiver receives a signal corresponding to the sum of the signals of the individual satellites. The receiver can engage in the processing of signals as if all of the possible satellites are present but, of course, some of the satellites are not within range of the GPS receiver's antenna (i.e., not detectible) so the processing results for those satellites are not viable. In other words, the signal arriving at the FIG. 1 antenna corresponds to

$\begin{matrix} {{\sum\limits_{n = 1}^{K}\begin{bmatrix} {{A^{n}{D^{n}(t)}{x_{C}^{n}(t)}{\cos \left( {{2\; \pi \; \left( f_{L\; 1} \right)t} + \phi_{1}} \right)}} +} \\ {B^{n}{D^{n}(t)}{x_{Y}^{n}(t)}{\sin \left( {{2\; {\pi \left( f_{L\; 1} \right)}t} + \phi_{1}} \right)}} \end{bmatrix}} + {Noise}} & \left( {1a} \right) \end{matrix}$

where K is the number of satellites that are within view of the antenna.

The following analysis follows the signal of only one satellite and, for sake of simplicity superscript n is omitted from the equations. The fact that other satellite signals exist is addressed later.

The transmitted signal is subjected to transit time delay before reaching the receiver, and the signal that is received by a first receiver's antenna experiences a Doppler frequency shift, f_(D), due to the satellite's movement in its orbit and possible receiver motion. Also, the transmitter and the receiver do not have a common clock, which means that even when the transmitter and the receiver clocks are at identical frequency, there is a phase difference between them. To make the equations more general, one might assume that there is a time shift (the transitions are not fully aligned) between the AD(t)x_(C)(t) and the BD(t)x_(Y)(t) , so the signal received at the first receiver can be expressed as

S _(received,1) =A ₁ D(t−τ_(C,1))x _(C)(t−τ_(C,1))cos(2π(f _(L1) +f _(D,1))(t−τ ₁)+φ_(1,1))+B ₁ D(t−τ _(Y,1))x _(Y)(t−τ _(Y,1))sin(2π(f _(L1) +f _(D,1))(t−τ ₁)+φ_(1,1))  (2)

or simplified to

S _(received,1) =A ₁ D(t−τ_(C,1))x _(C)(t−τ_(C,1))cos(2π(f _(L1) +f _(D,1))t+φ _(1,1) −φ _(2,1))+B ₁ D(t−τ _(Y,1))x _(Y)(t−τ _(Y,1))sin(2π(f _(L1) +f _(D,1))t)+φ_(1,1)−φ_(2,1))  (3)

It may be noted that for GPS, the C/A code and Y code are aligned, so this generalization is not needed for a GPS-based embodiment.

As shown in FIG. 1, the received signal is detected and amplified in element 10, conventionally downshifted in element 12 to a preselected intermediate frequency (IF) by multiplying the received signal by signal

sin(2π(f _(L1) −f _(IF))t+φ _(3,1))  (4)

and low pass filtered by element 15. The signal of equation (4) is generated from reference oscillator 20 by frequency synthesizer 22, where φ₃ is the phase of the locally generated signal (relative to the beginning of the data and code signals at the transmitting satellite which, of course, is unknown). The result at the output of the low pass filter is

S _(downshifted,1) =A ₁ D(t−τ _(C,1))x _(C)(t−τ _(C,1))cos(2π(f _(IF) +f _(D,1))t+φ _(1,1)−φ_(2,1)−φ_(3,1))+B ₁ D(t−τ _(Y,1))x _(Y)(t−τ _(Y,1))sin(2π(f _(IF) +f _(D,1))t+φ _(1,1)−φ_(2,1)−φ_(3,1))  (5)

or simplified to

S _(downshifted,1) =A ₁ D(t−τ _(C,1))x _(C)(t−τ _(C,1))cos(2π(f _(IF) +f _(D,1))t+θ ₁)+B ₁ D(t−τ _(Y,1))x _(Y)(t−τ _(Y,1))sin(2π(f _(IF) +f _(D,1))t+θ ₁).  (6)

It may be noted that the above-described use of downshifting by use of an IF modulator and low pass filter is illustrative, and that the A/D can be connected directly to the amplifier, and controlled to generate a digital signal as if it were downshifted as shown in FIG. 1.

As depicted, the output signal of the low pass filter is digitized in A/D converter 18 and applied to a combination of processor 40 and associated memory 41, where the remainder of the processing takes place.

The processing in accord with the instant disclosure, shown in FIG. 2, begins with a carrier generator module 31 creating the signal

cos(2π(f _(IF) +{circumflex over (f)} _(D))t+{circumflex over (θ)} ₁)−isin(2π(f _(IF) +{circumflex over (f)} _(D))t+{circumflex over (θ)} ₁),  (7)

where {circumflex over (f)}_(D) is an estimate of the Doppler frequency shift f_(D), and {circumflex over (θ)}₁ is an estimate of the phase θ₁. To be clear, the Doppler frequency shift and the phase estimates are estimates for a particular satellite. Multiplying the received (and downshifted) signal of equation (6) by the phasor of equation (7) in element 32 yields

$\begin{matrix} {{A_{1}{D\left( {t - \tau_{C,1}} \right)}{x_{C}\left( {t - \tau_{C,1}} \right)}\begin{Bmatrix} {{+ {\cos \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)}} +} \\ {i\; {\sin \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)}} \end{Bmatrix}} + {B_{1}{D\left( {t - \tau_{Y,1}} \right)}{x_{Y}\left( {t - \tau_{Y,1}} \right)}\begin{Bmatrix} {+ {\sin \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)}} \\ {{- i}\; {\cos \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)}} \end{Bmatrix}}} & (8) \end{matrix}$

which can be viewed as a real or inphase component (which is not shown in FIG. 2)

S _(I,1) =A ₁ D(t−τ _(C,1))x _(C)(t−τ _(C,1)){+cos(2π(f _(D,1) −{circumflex over (f)} _(D,1))t+θ ₁−{circumflex over (θ)}₁)}+B ₁ D(t−τ _(Y,1))x _(Y)(t−τ _(Y,1)){+sin(2π(f _(D,1) −{circumflex over (f)} _(D,1))t+θ ₁−{circumflex over (θ)}₁)}  (9)

and a quadrature component (which is shown in FIG. 2)

S _(Q,1) =A ₁ D(t−τ _(C,1))x _(C)(t−τ _(C,1)){sin(2π(f _(D,1) −{circumflex over (f)} _(D,1))t+θ ₁−{circumflex over (θ)}₁)}−B ₁ D(t−τ _(Y,1))x _(Y)(t−τ _(Y,1)){cos(2π(f _(D,1) −{circumflex over (f)} _(D,1))t+θ ₁−{circumflex over (θ)}₁)}  (10)

Integrating this signal in element 33 over a preselected interval that is long enough to filter out the 2f_(IF) signal component yields

$\begin{matrix} {{{\int{A_{1}{D\left( {t - \tau_{C,1}} \right)}{x_{C}\left( {t - \tau_{C,1}} \right)}\begin{Bmatrix} {{{\cos \left( {{2\; {\pi \left( {f_{IF} + {\hat{f}}_{D,1}} \right)}t} + {\hat{\theta}}_{1}} \right)}{\cos \left( {{2\; {\pi \left( {f_{IF} + f_{D,1}} \right)}t} + \theta_{1}} \right)}} -} \\ {i\; {\sin \left( {{2\; {\pi \left( {f_{IF} + {\hat{f}}_{D,1}} \right)}t} + {\hat{\theta}}_{1}} \right)}{\cos \left( {{2\; {\pi \left( {f_{IF} + f_{D,1}} \right)}t} + \theta_{1}} \right)}} \end{Bmatrix}}} + {\int{B_{1}{D\left( {t - \tau_{Y,1}} \right)}{x_{Y}\left( {t - \tau_{Y,1}} \right)}\begin{Bmatrix} {{{\cos \left( {{2\; {\pi \left( {f_{IF} + {\hat{f}}_{D,1}} \right)}t} + {\hat{\theta}}_{1}} \right)}{\sin \left( {{2\; {\pi \left( {f_{IF} + f_{D,1}} \right)}t} + \theta_{1}} \right)}} -} \\ {i\; {\sin \left( {{2\; {\pi \left( {f_{IF} + {\hat{f}}_{D,1}} \right)}t} + {\hat{\theta}}_{1}} \right)}{\sin \left( {{2\; {\pi \left( {f_{IF} + f_{D,1}} \right)}t} + \theta_{1}} \right)}} \end{Bmatrix}}}}} & (11) \end{matrix}$

which can be written as

$\begin{matrix} {{\int{A_{1}{D\left( {t - \tau_{C,1}} \right)}{x_{C}\left( {t - \tau_{C,1}} \right)}\begin{Bmatrix} {{\cos \left( {{2\; {\pi \left( {{2\; f_{IF}} + f_{D,1} + {\hat{f}}_{D,1}} \right)}t} + \theta_{1} + {\hat{\theta}}_{1}} \right)} +} \\ {{\cos \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)} -} \\ {{i\; {\sin \left( {{2\; {\pi \left( {{2\; f_{IF}} + f_{D,1} + {\hat{f}}_{D,1}} \right)}t} + \theta_{1} + {\hat{\theta}}_{1}} \right)}} +} \\ {i\; {\sin \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)}} \end{Bmatrix}}} + {\int{B_{1}{D\left( {t - \tau_{Y,1}} \right)}{x_{Y}\left( {t - \tau_{Y,1}} \right)}{\begin{Bmatrix} {{\sin \; \left( {{2\; {\pi \left( {{2\; f_{IF}} + f_{D,1} + {\hat{f}}_{D,1}} \right)}t} + \theta_{1} + {\hat{\theta}}_{1}} \right)} +} \\ {{\sin \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)} +} \\ {{i\; {\cos \left( {{2\; {\pi \left( {{2\; f_{IF}} + f_{D,1} + {\hat{f}}_{D,1}} \right)}t} + \theta_{1} + {\hat{\theta}}_{1}} \right)}} -} \\ {i\; {\cos \left( {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}t} + \theta_{1} - {\hat{\theta}}_{1}} \right)}} \end{Bmatrix}.}}}} & (12) \end{matrix}$

In accord with one implementation of the principles disclosed herein, unit 100 knows its own global position and it also knows the global position of a particular remote unit 200.

Illustratively, unit 100 is situated on the roof of a corporate headquarters building in one city, and unit 200 is situated on the roof of a corporate building in another city. If unit 100 does not know the location of unit 200, it may obtain it from unit 200 and verify that the location is bona fide in the manner disclosed in the parent application identified above. Armed with this knowledge, unit 100 is able to send information to unit 200 by generating and processing a signal that is a close facsimile of the signal that unit 100 knows is received by unit 200. Specifically, unit 100 may modulate its signal with a time delay (delay-based encoding), a frequency shift (frequency-based encoding), or both, in order to effect secure information transmittal to unit 200. To realize frequency-based encoding, unit 100 may proceed as follows: from readily available information, unit 100 obtains a fairly good estimate of the Doppler frequency shift, {circumflex over (f)}_(D,2), of the signal arriving at the unit 200 location from a particular satellite (which is a fairly good estimate), generates a reference signal with this frequency in element 35, frequency shifts that signal by a chosen frequency value, f_(datum) in element 36, to obtain a frequency {tilde over (f)}_(D,2) (i.e., {tilde over (f)}_(D,2)={circumflex over (f)}_(D,2)+f_(datum)), and thus creates the signal

cos[2π(f _(IF) +{tilde over (f)} _(D,2))(t)+{circumflex over (θ)}₂ ]−isin[2π(f _(IF) +{tilde over (f)} _(D,2))(t)+{circumflex over (θ)}₂]  (13)

that is applied to element 37. To realize delay-based encoding, unit 100 may proceed as follows: element 37 multiplies the signal of equation (13) by the quadrature signal of equation (12), delays it by δ_(datum) in element 38, and outputs the signal

$\begin{matrix} {s_{Q,1,2,\delta} = {\begin{Bmatrix} {A_{1}{D\left( {t - \tau_{C,1} - \delta_{datum}} \right)}{x_{C}\left( {t - \tau_{C,1} - \delta_{datum}} \right)}} \\ {{\sin \left\lbrack {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}\left( {t - \delta_{datum}} \right)} + \theta_{1} - {\hat{\theta}}_{1}} \right\rbrack} -} \\ {B_{1}{D\left( {t - \tau_{Y,1} - \delta_{datum}} \right)}{x_{Y}\left( {t - \tau_{Y,1} - \delta_{datum}} \right)}} \\ {\cos \left\lbrack {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}\left( {t - \delta_{datum}} \right)} + \theta_{1} - {\hat{\theta}}_{1}} \right\rbrack} \end{Bmatrix} \times 2\begin{Bmatrix} {{\cos \left\lbrack {{2\; {\pi \left( {f_{IF} + {\hat{f}}_{D,2}} \right)}\left( {t - \delta_{datum}} \right)} + {\hat{\theta}}_{2}} \right\rbrack} -} \\ {i\; {\sin \left\lbrack {{2\; {\pi \left( {f_{IF} + {\hat{f}}_{D,2}} \right)}\left( {t - \delta_{datum}} \right)} + {\hat{\theta}}_{2}} \right\rbrack}} \end{Bmatrix}}} & (14) \end{matrix}$

which can be expressed more compactly as

$\begin{matrix} {{s_{Q,1,2,\delta} = {\begin{Bmatrix} {{A_{1}{D\left( {t - \tau_{C,1} - \delta_{datum}} \right)}{x_{C}\left( {t - \tau_{C,1} - \delta_{datum}} \right)}{\sin (\alpha)}} -} \\ {B_{1}{D\left( {t - \tau_{Y,1} - \delta_{datum}} \right)}{x_{Y}\left( {t - \tau_{Y,1} - \delta_{datum}} \right)}{\cos (\alpha)}} \end{Bmatrix} \times 2\left\{ {{\cos (\beta)} - {i\; {\sin (\beta)}}} \right\}}}\mspace{14mu} \mspace{79mu} {where}\mspace{14mu} \mspace{79mu} {\alpha = {{2\; {\pi \left( {f_{D,1} - {\hat{f}}_{D,1}} \right)}\left( {t - \delta_{datum}} \right)} + \theta_{1} - {{\hat{\theta}}_{1}\mspace{14mu} {and}}}}\mspace{20mu} {\beta = {{2\; {\pi \left( {f_{IF} + {\overset{\sim}{f}}_{D,2}} \right)}\left( {t - \delta_{datum}} \right)} + {{\hat{\theta}}_{2}.}}}} & (15) \end{matrix}$

It might be remembered that the analysis above focuses on the signal of one satellite while recognizing that signals from a number of satellites are concurrently processed, and it also should be remembered that the signal of equation (13) that is created within unit 100 pertains, relative to the Doppler shift and delay, to a single satellite that is chosen by unit 100. Thus, it should be realized that the equation (15) signal is really a sum of signals of the form found within the brackets {} that are all multiplied by the 2{cos(β)−isin(β)} term that is adjusted to parameters for the one chosen satellite; to wit, the output signal of unit 100, S₁₀₀, is

$\begin{matrix} {{s_{100} = {2\left\{ {{\cos (\beta)} - {i\; {\sin (\beta)}}} \right\} {\sum\limits_{n = 1}^{K}\begin{Bmatrix} {{A_{1}^{n}{D^{n}\left( {t - \tau_{C,1} - \delta_{datum}} \right)}{x_{C}^{n}\left( {t - \tau_{C,1} - \delta_{datum}} \right)}{\sin \left( \alpha_{i} \right)}} -} \\ {B_{1}^{n}{D^{n}\left( {t - \tau_{Y,1} - \delta_{datum}} \right)}{x_{Y}^{n}\left( {t - \tau_{Y,1} - \delta_{datum}} \right)}{\cos \left( \alpha_{i} \right)}} \end{Bmatrix}}}}\mspace{20mu} {where}\mspace{20mu} {\alpha_{i} = {{2\; {\pi \left( {f_{D,1}^{(i)} - {\hat{f}}_{D,1}} \right)}\left( {t - \delta_{datum}} \right)} + \theta_{1}^{(i)} - {\hat{\theta}}_{1}}}} & \left( {15a} \right) \end{matrix}$

f_(D,1) ^((i)) is the Doppler of satellite i as measured at unit 100 θ₁ ^((i)) is the phase shift of the signal from satellite i as measured at unit 100.

Unit 100 sends the signal of equation (15a) to unit 200, which also receives its own GPS signal, s₂. Within unit 200 signal s₂ is downshifted to develop the signal

s ₂ ·s _(mix,2) =A ₂ D(t−τ _(C,2))x _(C)(t−τ _(C,2))cos[2π(f _(IF) +f _(D,2))t+θ′ ₂ ]+B ₂ D(t−τ _(Y,2)(x _(P)(t−τ _(Y,2))sin[2π(f _(IF) +f _(D,2))t+θ′ ₂],  (16)

where τ_(c,2), τ_(c,2) and f_(D,2) are the delays and Doppler frequency shift experienced by the signal that reaches unit 200. It is noted that in a conventional manner the Doppler frequency f_(D,2) may be determined, for example by tracking in a frequency-lock or phase-lock loop.

In accord with one embodiment of the principles disclosed herein and depicted in FIG. 3, unit 200 receives a signal by means of elements that correspond to elements 10, 12, 15, 18, 20 and 22 of FIG. 1, but which are not shown in FIG. 2 for sake of clarity, and within the processor of unit 200 (which corresponds to processor 40 of FIG. 1) performs what effectively is a two-dimensional correlation between the signal received from the satellites and the signal received from unit 100, by shifting the signal received from the satellites (i.e., the signal of equation (16)) by f^(*) in element 53, delaying the shifted signal by δ^(*) in element 54, multiplying the output of element 54 by the signal received from unit 100 (i.e., the signal of equation (15) in element 55), integrating in element 56, and repeating the process with different values of f^(*) and δ^(*) to find a peak, all under management of controller 57.

The frequency shifting and the time delaying of the equation (16) signal yields

s _(2,δ) =A ₂ D(t−τ _(C,2)−δ^(*))x _(C)(t−τ _(C,2)−δ^(*))cos[2π(f _(IF) +{hacek over (f)} _(D,2))(t−δ ^(*))+θ₂ ′]+B ₂ D(t−τ _(Y,2)−δ^(*))x _(P)(t−τ _(Y,2)−δ^(*))sin[2π(f _(IF) +{hacek over (f)} _(D,2))(t−δ^(*))+θ₂′]  (17)

where {hacek over (f)}_(D,2)=f_(D,2)+f^(*). Labeling 2π(f_(IF)+{hacek over (f)}_(D,2))(t−δ^(*))+θ₂′ as γ yields

s _(2,δ) =A ₂ D(t−τ _(C,2)−δ^(*))x _(C)(t−τ _(C,2)−δ^(*))cos(γ) +B ₂ D(t−τ _(Y,2)−δ^(*))x _(P)(t−τ _(Y,2)−δ^(*))sin(γ)  (18)

The multiplication of the equation (18) signal by the signal of equation (15) yields

$\begin{matrix} {{s_{Q,1,2,\delta} \cdot s_{2,\delta^{*}}} = {\begin{Bmatrix} {{A_{1}{D\left( {t - \tau_{C,1} - \delta} \right)}{x_{C}\left( {t - \tau_{C,1} - \delta} \right)}{\sin (\alpha)}} -} \\ {B_{1}{D\left( {t - \tau_{Y,1} - \delta} \right)}{x_{P}\left( {t - \tau_{Y,1} - \delta} \right)}{\cos (\alpha)}} \end{Bmatrix} \times 2\left\{ {{\cos (\beta)} - {i\; {\sin (\beta)}}} \right\} \times {\begin{Bmatrix} {{A_{2}{D\left( {t - \tau_{C,2} - \delta^{*}} \right)}{x_{C}\left( {t - \tau_{C,2} - \delta^{*}} \right)}{\cos (\gamma)}} +} \\ {B_{2}{D\left( {t - \tau_{Y,2} - \delta^{*}} \right)}{x_{P}\left( {t - \tau_{Y,2} - \delta^{*}} \right)}{\sin (\gamma)}} \end{Bmatrix}.}}} & (19) \end{matrix}$

Carrying out the multiplication, grouping terms, and dropping the terms involving cos(γ+β) and sin(γ+β) because subsequent integration acts as low pass filtering, yields

$\begin{matrix} {\begin{matrix} {{s_{Q,1,2,\delta} \cdot s_{2,\delta^{*}}} = {\left( {U - V} \right) \times \left( {W + {iX} + Y - {iZ}} \right)}} \\ {= \begin{Bmatrix} {{UW} + {iUX} + {UY} - {iUZ} -} \\ {{VW} - {iVX} - {VY} + {iVZ}} \end{Bmatrix}} \end{matrix}{where}} & (20) \\ {U = {A_{1}{D\left( {t - \tau_{C,1} - \delta} \right)}{x_{C}\left( {t - \tau_{C,1} - \delta} \right)}{\sin (\alpha)}}} & (21) \\ {V = {B_{1}{D\left( {t - \tau_{Y,1} - \delta} \right)}{x_{Y}\left( {t - \tau_{Y,1} - \delta} \right)}{\cos (\alpha)}}} & (22) \\ {W = {A_{2}{D\left( {t - \tau_{C,2} - \delta^{*}} \right)}{x_{C}\left( {t - \tau_{C,2} - \delta^{*}} \right)}{\cos \left( {\gamma - \beta} \right)}}} & (23) \\ {X = {A_{2}{D\left( {t - \tau_{C,2} - \delta^{*}} \right)}{x_{C}\left( {t - \tau_{C,2} - \delta^{*}} \right)}{\sin \left( {\gamma - \beta} \right)}}} & (24) \\ {Y = {B_{2}{D\left( {t - \tau_{Y,2} - \delta^{*}} \right)}{x_{Y}\left( {t - \tau_{Y,2} - \delta^{*}} \right)}{\sin \left( {\gamma - \beta} \right)}}} & (25) \\ {Z = {B_{2}{D\left( {t - \tau_{Y,2} - \delta^{*}} \right)}{x_{Y}\left( {t - \tau_{Y,2} - \delta^{*}} \right)}{\cos \left( {\gamma - \beta} \right)}}} & (26) \end{matrix}$

The signal of equation (19) is integrated for various values of the delay δ^(*) and frequency offset f^(*) to develop

$\begin{matrix} \begin{matrix} {S_{\delta,\delta^{*}} = {\int{s_{Q,1,2,\delta} \cdot s_{2,\delta^{*}}}}} \\ {= {\int{\left\{ {{UW} + {iUX} + {UY} - {iUZ} - {VW} - {iVX} - {VY} + {iVZ}} \right\}.}}} \end{matrix} & (27) \end{matrix}$

At this point it may be noted that although the signal of equation (18) shows the signal of one satellite, unit 200 actually develops a signal that includes a contribution from all visible satellites. It can be shown that each of the integration results therefore may result in a plurality of peaks, but the one that pertains to the chosen satellite is the peak with highest energy. The energy of this peak, relative to the peaks for the other satellites commonly visible to units 100 and 200, may be further enhanced through signal processing; for example, with a directional antenna or a beamsteering antenna array focused to enhance the signal of the satellite of interest.

The Doppler frequency estimate {circumflex over (f)}_(D,1) is very close to f_(D,1), and the expression θ₁ is very close to {circumflex over (θ)}₁ (as a result of the capture and tracking operations). Consequently, all terms containing the factor “U” (which includes sin(α)≈α≈0) drop out. Also, the cos(α) can be replaced by 1. Likewise, it is noted that the code sequence x_(C) is orthogonal to the code sequence x_(Y) (meaning that following integration the sum of their product is zero). Consequently, the “VW” and “VX” terms drop out. Additionally, the “V” term, which contains the cos(α) reduces to V=B₁ D(t−τ_(Y,1)−δ) x_(Y) (t−τ_(Y,1)−δ), leaving

S _(δ,δ) _(*) =∫{−VY+iVZ}=−∫VY+i∫VZ.   (28)

As indicated above, the expression of equation (27) is evaluated for different values of δ^(*) and f^(*) (effectively a two-dimensional correlation), and values δ_(best) ^(*) and f_(best) ^(*) are found that yield the maximum magnitude; i.e.,

$\begin{matrix} {\mspace{79mu} {{{\left. S_{\delta,\delta^{*}} \right|_{\max}}^{2} = {\max \begin{pmatrix} {\left( {\int{{\Psi \left( {t,\delta^{*}} \right)}{\cos (\alpha)}{\sin \left( {\gamma - \beta} \right)}}} \right)^{2} +} \\ \left( {\int{{\Psi \left( {t,\delta^{*}} \right)}{\cos (\alpha)}{\cos \left( {\gamma - \beta} \right)}}} \right)^{2} \end{pmatrix}}}\mspace{20mu} {where}{{\Psi \left( {t,\delta^{*}} \right)} = {\left( {B_{1}{D\left( {t - \tau_{Y,1} - \delta} \right)}} \right)\left( {B_{2}{D\left( {t - \tau_{Y,2} - \delta^{*}} \right)}} \right){x_{Y}\left( {t - \tau_{Y,1} - \delta} \right)}{{x_{Y}\left( {t - \tau_{Y,2} - \delta^{*}} \right)}.}}}}} & (29) \end{matrix}$

When the approximations are good; that is, f_(D,1)≈{circumflex over (f)}_(D,1) and θ₁≈{circumflex over (θ)}₁ then cos(α)≈1, and reinstating what γ and β stand for, and looking only within the brackets, we have

$\begin{matrix} {\begin{pmatrix} {\begin{pmatrix} {\int{{\Psi \left( {t,\delta^{*}} \right)}{x_{Y}\left( {t - \tau_{Y,1} - \delta} \right)}{x_{Y}\left( {t - \tau_{Y,2} - \delta^{*}} \right)}}} \\ {\sin \left( {{2{\pi \left( {{\overset{\Cup}{f}}_{D,2} - {\overset{\Cap}{f}}_{D,2}} \right)}t} + \Gamma} \right)} \end{pmatrix}^{2} +} \\ \begin{pmatrix} {\int{{\Psi \left( {t,\delta^{*}} \right)}{x_{Y}\left( {t - \tau_{Y,1} - \delta} \right)}{x_{Y}\left( {t - \tau_{Y,2} - \delta^{*}} \right)}}} \\ {\cos \left( {{2{\pi \left( {{\overset{\Cup}{f}}_{D,2} - {\overset{\Cap}{f}}_{D,2}} \right)}t} + \Gamma} \right)} \end{pmatrix}^{2} \end{pmatrix}{where}} & (30) \\ {\Gamma = {{2{\pi \left\lbrack {{\left( {f_{IF} + {\overset{\sim}{f}}_{D,2}} \right)\delta} - {\left( {f_{IF} + {\overset{\Cup}{f}}_{D,2}} \right)\delta^{*}}} \right\rbrack}} + \theta_{2}^{\prime} - {{\hat{\theta}}_{2}.}}} & (31) \end{matrix}$

Under the assumption that the code and the data take on value of only +1 or −1, and because the autocorrelation of x_(Y)(t) is close to zero at all but t=0, it follows that equation (29) is essentially 0 except when (−τ_(Y,1)−δ)=(−τ_(Y,2)−δ^(*)), or

δ=δ_(best) ^(*)−τ_(Y,1)+τ_(Y,2).  (32)

at which point it degenerates to

$\begin{matrix} \begin{matrix} {\left. S_{\delta,\delta^{*}} \right|_{\max} = {\left( {B_{1}B_{2}} \right)^{2}\begin{bmatrix} {\left( {\int{\sin \left( {{2{\pi \left( {{\overset{\Cup}{f}}_{D,2} - {\overset{\sim}{f}}_{D,2}} \right)}t} + \Gamma} \right)}} \right)^{2} +} \\ \left( {\int{\cos \left( {{2{\pi \left( {{\overset{\Cup}{f}}_{D,2} - {\overset{\sim}{f}}_{D,2}} \right)}t} + \Gamma} \right)}} \right)^{2} \end{bmatrix}}} \\ {= {\left( {B_{1}B_{2}} \right)^{2}\begin{bmatrix} {\left( {\int{\sin \left( {{2{\pi \left( {\Delta \; f} \right)}t} + \Gamma} \right)}} \right)^{2} +} \\ \left( {\int{\cos \left( {{2{\pi \left( {\Delta \; f} \right)}t} + \Gamma} \right)}} \right)^{2} \end{bmatrix}}} \end{matrix} & (33) \end{matrix}$

where Δf={hacek over (f)}_(D,2)−{tilde over (f)}_(D,2) which leads to

Δf=(f _(D,2) −{circumflex over (f)} _(D,2))+(f _(best) ^(*) −f _(secret))  (34)

The peak in the value of S_(δ,δ) _(*) |_(max) occurs when Δf is very small. Since the estimate {circumflex over (f)}_(D,2) is very close to f_(D,2), equation (34) degenerates to f_(secret)=f^(*), and that equation (33) reduces to:

S_(δ,δ) _(*) |_(max)=(B₁B₂)².  (35)

What we have, then, is that when the transit delay and Doppler frequency shift information derived from published tables, geometric considerations, etc. are accurate, the autocorrelation has a peak only when

(a) equation (32) condition holds; i.e., δ_(datum)=δ^(*)−τ_(Y,1)+τ_(Y,2), and

(b) equation (34) condition holds; i.e., f_(datum)=f^(*).

Since unit 200 can compute the transit delay difference (τ_(Y,2)−τ_(Y,1)) using, for example, published tables describing the satellite orbits, the δ_(datum) information injected into the signal by unit 100 is easily recovered at unit 200 (equation 32). Conversely, when unit 100 wishes unit 200 to recover a particular value δ^(*), unit 100 accounts for the transit delay difference and computes the δ_(datum) that it needs to send. Also, when δ_(datum)=0, equation (32) yields a value that corresponds to (τ_(Y,1)−τ_(Y,2)), and from the above-mentioned tables, unit 200 can determine the location of unit 100.

The same capability exists in connection with the frequencies, in that information can be communicated from unit 100 to unit 200 via the f_(datum) value.

Going back to equation (12), it is noted that it includes a signal component that is modulated by the x_(C) code, which is publicly known. The chip rate of the x_(C) code has a bandwidth of about 2 MHz. (2 MHz main lobe).

Based on this observation, an alternative embodiment in accord with the principles disclosed herein passes the signal of equation (12) through a bandstop filter that is adjusted to remove the publicly known x_(C) code-modulated component (alternatively one can pass the signal of equations (13) or (14) through the bandstop filter). Passing the signal though the such a filter alters the equation (15) signal to

s_(Q,1,2,δ)=−2[B ₁ D(t−τ _(Y,1)−δ)x _(Y)(t−τ _(Y,1)−δ)cos(α)][cos(β)−isin(β)]  (36)

but that does NOT change equation (28). The difference, of course, is that the embodiment that includes the bandstop filter does not send a signal that includes a knowable signal component that perhaps might be used by an adversary, and yet accomplishes the same result as an embodiment that does not use the bandstop filter.

In yet another embodiment in accord with the principles disclosed herein, the signal that is processed by unit 100 and sent to unit 200 can be the signal of just a selected subset of the visible satellites; perhaps just one of the satellites. Illustratively, this is accomplished by having the input antenna of unit 100 be steerable, though other more complicated techniques that would work as well. Any of the known designs or techniques for creating a steerable antenna is acceptable. There are also other techniques that may be used which work as well. This method reduces the number of peaks that are achievable at an adversary unit, as well as at unit 200, and further it obscures the satellite signal which was used for the delay-based and/or frequency-based encoding, making reverse-engineering of the values of δ_(datum) and/or f_(datum) substantially harder (or impracticable) for an adversary.

The above embodiments do not specify the duration of the signal that unit 100 sends to unit 200. A short duration results in a smaller correlation peak. A smaller peak is more difficult to detect in the presence of peaks that result from spurious signals (noise). It is, therefore, useful to limit the duration of the signal that unit 100 sends.

The above discloses the notion that two pieces of information can be send by unit 100 to unit 200, in a secure manner, with each transmission of a signal segment: one embedded in δ_(datum) and the other embedded in f_(datum). Data can be communicated continuously, of course, by sending {δ_(datum), f_(datum)}-tuples in successive frames.

It may be noted that although the above discloses the principles of this invention in connection with GPS signals, that is not a limitation of this invention. Alternate sources that can create signal like the Y code include device that operate in a WiFi protocol, Blue tooth protocol, cellular telephony protocols, etc.

It may be further noted that the illustrative embodiment disclosed above is adapted to a situation where the location of unit 100 is known to unit 200. 

1. A method executed by a first unit that is coupled to a first antenna that is situated at a first location, which antenna is constructed to receive a signal comprising a sum of constituent signal, each from a different source of a plurality of sources, and each of the constituent signals containing a component that is modulated by a known code and a component that is modulated by a code that is not publicly known and not available to said first unit (secret code), for communicating a data signal from said first unit to a second unit that is coupled to a second antenna that is situated at a second location that is known to said firs unit, comprising the steps of: processing said signal to remove a Doppler frequency shift that said signal experiences in arriving at said first antenna, thereby creating a signal A; creating a signal B that corresponds to a signal that is expected to have been received at said second antenna in response to a signal transmitted by a particular one of said sources; combining signal A, signal B, and said data signal to form a signal C, where said data signal is expressed as time delay, frequency shift, or both; and sending signal C to said second unit. 